Characteristic equations for dierent ARROW structures
ثبت نشده
چکیده
Based on radiation modes and phase relations in dierent ARROW structures, the characteristic equations are presented that can avoid root searching in the complex plane and ®nd the eective index, loss and ®eld pro®le easily. This simple model gives an accurate intuitive picture for low loss leaky modes and it can be used to design and optimize the low loss ARROW devices of practical interest.
منابع مشابه
Squares in Fork Arrow Logic
In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema’s non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork o...
متن کاملOn the Performance of Different Empirical Loss Equations for Flow Through Coarse Porous Media (RESEARCH NOTE)
In this paper, the empirical equations that estimate hydraulic parameters for non-linear flow through coarse porous media are evaluated using a series of independent data collected in the laboratory. In this regard, three different relatively uniform soils ranging in size from 8.5 to 27.6 mm have been selected and three random samples drawn from each material. The physical characteristics such ...
متن کاملData Classification Component in a Deductive Database System and Its Application to Protein Structural Analysis
We also thank the anonymous referees for their valuable comments. 1 Summary Scientic database systems for the analysis of genes and proteins are becoming very important these days. We have developed a deductive database system PACADE for analyzing the three dimensional and secondary structures of proteins. In this paper, we describe the statistical data classication component of PACADE. We impl...
متن کاملHeuristic Algorithms for the Triangulation of Graphs
Dierent uncertainty propagation algorithms in graph-ical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from dierent triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resulting triangulated graph. The problem of obtaining an optimum graph triangulation is known to be NP-com...
متن کاملNumerical Discrete Algorithm for Some Nonlinear Problems
In this paper we use the eigenfunctions of the Laplacian to approximate the solution of some nonlinear equations which are used to model natural phenomena (as the Navier-Stokes flow equations, for instance). In this respect we propose a numerical algorithm, combining the Uzawa and Arrow-Hurwitz algorithms. The algorithm proposed here shares features from both algorithms, and it has the followin...
متن کامل